On abelian saturated infinite words
نویسندگان
چکیده
منابع مشابه
Ultimately Constant Abelian Complexity of Infinite Words
It is known that there are recurrent words with constant abelian complexity three, but not with constant complexity four. We prove that there are recurrent words with ultimately constant complexity c for every c.
متن کاملOn Abelian and Additive Complexity in Infinite Words
The study of the structure of infinite words having bounded abelian complexity was initiated by G. Richomme, K. Saari, and L. Q. Zamboni. In this note we define bounded additive complexity for infinite words over a finite subset of Zm. We provide an alternative proof of one of the results of the aforementioned authors.
متن کاملAnother Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words
The binomial coefficient of two words u and v is the number of times v occurs as a subsequence of u. Based on this classical notion, we introduce the mbinomial equivalence of two words refining the abelian equivalence. Two words x and y are m-binomially equivalent, if, for all words v of length at most m, the binomial coefficients of x and v and respectively, y and v are equal. The m-binomial c...
متن کاملAbelian complexity of infinite words associated with quadratic Parry numbers
We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers. © 2011 Elsevier B.V. All rights reserved.
متن کاملOn a generalization of Abelian equivalence and complexity of infinite words
In this paper we introduce and study a family of complexity functions of infinite words indexed by k ∈ Z+ ∪ {+∞}. Let k ∈ Z+ ∪ {+∞} and A be a finite non-empty set. Two finite words u and v in A are said to be k-Abelian equivalent if for all x ∈ A of length less than or equal to k, the number of occurrences of x in u is equal to the number of occurrences of x in v. This defines a family of equi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2018.05.013